Ant Colony Algorithms for the Dynamic Vehicle Routing Problem with Time Windows
نویسندگان
چکیده
The Vehicle Routing Problem with Time Windows relates to frequently occuring real world problems in logistics. Much work has been done on solving static routing problems but solving the dynamic variants has not been given an equal amount of attention, while these are even more relevant to most companies in logistics and transportation. In this work an Ant Colony Optimization algorithm for solving the Dynamic Vehicle Routing Problem with Time Windows is proposed. Customers and time windows are inserted during the working day and need to be integrated in partially committed solutions. Results are presented on a benchmark that generalizes Solomon’s classical benchmark with varying degrees of dynamicity and different variants, including pheromone preservation and the min-max ant system.
منابع مشابه
Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملAnt Colony Optimisation for vehicle routing problems: from theory to applications
Ant Colony Optimisation is a metaheuristic for combinatorial optimisation problems. In this paper we show its successful application to the Vehicle Routing Problem (VRP). First, we introduce VRP and its many variants, such as VRP with Time Windows, Time Dependent VRP, Dynamic VRP, VRP with Pickup and Delivery. These variants have been formulated in order to bring the VRP as close as possible to...
متن کاملAn Improved Ant Colony Algorithm to Solve Vehicle Routing Problem with Time Windows
This paper presents an improved ant colony optimization algorithm (ACO algorithm) based on Ito differential equations, the proposed algorithm integrates the versatility of Ito thought with the accuracy of ACO algorithm in solving the vehicle routing problem (VRP), and it executes simultaneous move and wave process, and employs exercise ability to unify move and wave intensity. Move and wave ope...
متن کاملMultiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The elements that characterize it are mainly the presence of multiple objectives, constraints concerning multiple time windows, heterogeneous fleet, maximum duration of the subtours, and multiple visits. Two variants of the...
متن کامل